A Fluid Heuristic for Minimizing Makespan in Job Shops

A Heuristic to Minimize Makespan in Proportional Parallel Flow Shops

This paper addresses the problem of minimizing the makespan on a two-stage parallel flow shops with proportional processing times. The problem of scheduling n independent jobs on m proportional parallel flow shops to minimize makespan is known to be NP-hard and hence too difficult to solve in polynomial time. A multiphase heuristic algorithm to minimize the makespan on two proportional parallel...

Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...

Decomposition-based Makespan Minimization in Job Shops

This paper proposes a decomposition-based heuristic approach to minimizing the makespan of job shops. In general, decomposition methods first divide the whole problem into several sub-problems, solve them and then combine sub-schedules to obtain a good feasible schedule. Although it may be reasonable to minimize the makespan of each sub-problem, its optimality will be lost when combining sub-sc...

An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops

A Heuristic Algorithm for Minimizing the Expected Makespan in Two-Machine Flow Shops with Fuzzy Processing Time

Production scheduling, with the objective of minimizing the makespan, is an important task in manufacturing systems. In the past, the processing time for each job was usually assumed to be exactly known, but in many realworld applications, processing times may vary dynamically due to human factors or operating faults. Fuzzy programming theory has been developed for flow shop scheduling problems...